Space- and computationally-efficient set reconciliation via parity bitmap sketch (PBS)
نویسندگان
چکیده
منابع مشابه
A Secure Sketch for Set Reconciliation
In this paper we present an implementation of an algorithm for creating a secure sketch for the set difference as defined in [1]. This sketch is a short, efficiently computable description of a set such that, given a second set that differs only in a small percentage of elements, the original can be reconstructed. However, this sketch is secure in the sense that in the absence of such a similar...
متن کاملSpace- and Time-Efficient BDD Construction via Working Set Control
Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. Efficient BDD construction techniques become more important as the complexity of protocol and circuit designs increases. This paper addresses this issue by introducing three techniques based on working set control. First, we introduce a novel BDD construction algorithm based on partial breadth-first ex...
متن کاملEfficient search space exploration for sketch recognition
What: Sketch recognition is a natural form of interaction that has been receiving increasing attention in the research community [4], [1], [6]. One of the challenges in sketch recognition is efficient recognition. We propose to create efficient recognition by treating sketching as a dynamic process and by deriving recognition strategies from the object models specified in the language proposed ...
متن کاملSet-membership parity space hybrid system diagnosis
In this paper, diagnosis for hybrid systems using a parity space approach that considers model uncertainty is proposed. The hybrid diagnoser is composed of modules which carry out the mode recognition and diagnosis tasks interacting each other, since the diagnosis module adapts accordingly to the current hybrid system mode. Moreover, the methodology takes into account the unknown but bounded un...
متن کاملComputationally Efficient Forgetting via Base-Level Activation
As we apply cognitive models to complex, temporally extended tasks, removing declarative knowledge from memory, or forgetting, will become important both to model human behavior, as well as to scale computationally. The base-level activation (BLA) model predicts that the availability of specific memories is sensitive to frequency and recency of use. Memory decay based on this model has long bee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2020
ISSN: 2150-8097
DOI: 10.14778/3436905.3436906